Threshold RSA for Dynamic and Ad-Hoc Groups

نویسندگان

  • Rosario Gennaro
  • Shai Halevi
  • Hugo Krawczyk
  • Tal Rabin
چکیده

We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs (“mobile ad-hoc networks”). We first show that known threshold RSA signatures (in particular the most efficient known scheme due to Shoup) are not practical enough for realistic use in these highly-constrained environments. Our contribution is in presenting variants of Shoup’s protocol that provide the efficiency and flexibility needed in ad-hoc groups, and add the capability of incorporating new members (share-holders) to the group of potential signers without relying on central authorities. The schemes are efficient, fully non-interactive and do not assume broadcast.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Proactive RSA Scheme for Large-Scale Ad Hoc Networks

In this paper, we present an efficient proactive threshold RSA signature scheme for large-scale ad hoc networks. Our scheme has two advantages. Firstly, the building blocks of the whole scheme are proven secure. Secondly, the whole scheme is efficient.

متن کامل

RSA and Elliptic Curve- ElGamal Threshold Cryptography (ECCEG-TC) Implementations for Secure Data Forwarding in MANETs

A Mobile Ad hoc Network (MANET) consists of multiple wireless mobile devices that form a network on the fly to allow communication with each other without any infrastructure. Due to its nature, providing security in these networks is challenging. Threshold Cryptography (TC) provides a promise of securing these networks. In this paper, we discuss our RSA-based Threshold Cryptography (RSA-TC) and...

متن کامل

Threshold and Revocation Cryptosystems via Extractable Hash Proofs

We present a new unifying framework for constructing non-interactive threshold encryption and signature schemes, as well as broadcast encryption schemes, and in particular, derive several new cryptosystems based on hardness of factoring, including: – a threshold signature scheme (in the random oracle model) that supports ad-hoc groups (i.e., exponential number of identities and the set-up is in...

متن کامل

A Novel Universally Composable Threshold Signature Protocol for Mobile Ad-Hoc Network

Mobile ad-hoc network has received a lot of attention recently, adapting threshold signature schemes to work in such environments is challenging. In this study, we propose a novel threshold RSA signature protocol. The proposed protocol is suitable for the mobile ad-hoc networks, for it is completely non-interactive and has simple algorithm. Furthermore, we will give the concrete analysis of the...

متن کامل

Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2008  شماره 

صفحات  -

تاریخ انتشار 2008